Shifting technique vs. pointer structures in unsymmetric sparse linear equations systems solver

نویسنده

  • Marek M. Stabrowski
چکیده

The research reported in this paper presents a new idea of the storage structure of sparse matrices. This structure is used in the multi-option solver of linear equation systems with unsymmetrical sparse coefficient matrices. The new solver is compared comprehensively with the analogous (identical numerical method used) solver of the classical type. The tests of new solver have been performed on a quite broad spectrum of hardware platforms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shifting technique vs . pointer structures in unsymmetric sparse linear equations systems solver Marek

The research reported in this paper presents a new idea of the storage structure of sparse matrices. This structure is used in the multi-option solver of linear equation systems with unsymmetrical sparse coefficient matrices. The new solver is compared comprehensively with the analogous (identical numerical method used) solver of the classical type. The tests of new solver have been performed o...

متن کامل

NUMERICAL ANALYSIS GROUP PROGRESS REPORT January 1994 – December 1995

2 Sparse Matrices ……………………………………………………………………………… 4 2.1 The direct solution of sparse unsymmetric linear sets of equations (I.S. Duff and J.K. Reid) …………………………………………………………………………… 4 2.2 The design and use of algorithms for permuting large entries to the diagonal 2.6 Element resequencing for use with a multiple front solver (J. A. Scott) ………… 10 2.7 Exploiting zeros on the diagonal in the direct s...

متن کامل

Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices

We present algorithms for the symbolic and numerical factorization phases in the direct solution of sparse unsymmetric systems of linear equations. We have modified a classical symbolic factorization algorithm for unsymmetric matrices to inexpensively compute minimal elimination structures. We give an efficient algorithm to compute a near-minimal data-dependency graph for unsymmetric multifront...

متن کامل

A Large-Grain Parallel Sparse System Solver

The eeciency of solving sparse linear systems on parallel processors and more complex multicluster architectures such as Cedar is greatly enhanced if relatively large grain computational tasks can be assigned to each cluster or processor. The ordering of a system into a bordered block upper triangular form facilitates a reasonable large-grain partitioning. A new algorithm which produces this fo...

متن کامل

Solving Unsymmetric Sparse Systems of Linear Equations with PARDISO

Supernode partitioning for unsymmetric matrices together with complete block diagonal supernode pivoting and asynchronous computation can achieve high gigaflop rates for parallel sparse LU factorization on shared memory parallel computers. The progress in weighted graph matching algorithms helps to extend these concepts further and unsymmetric prepermutation of rows is used to place large matri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Annales UMCS, Informatica

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2003